Genet Ic Programming
نویسندگان
چکیده
The cart centering problem is well known in the eld of evolutionary algorithms and has often been used as a proof of concept problem for techniques such as Genetic Programming. This paper describes the application of a grammar based, position independent encoding scheme, Chorus, to the problem. It is shown that using the traditional experimental setup employed to solve the problem, Chorus is able to come up with the solutions which appear to beat the theoretically optimal solution, known and accepted for decades in the eld of control theory. However, further investigation into the literature of the relevant area reveals that there is an inherent error in the standard E.C. experimental approach to this problem, leaving room for a multitude of solutions to outperform the apparent best. This argument is validated by the performance of Chorus, producing better solutions at a number of occasions.
منابع مشابه
A Machine-Independent Analysis of Parallel Genetic Algorithms
Abs t ract . This paper presents a machine-independent study of parallel genetic algorithm performance. Our approach utilizes a dataflow model of computat ion in conjunction with Sisal, an implicit parallel programming language. We compare problem-solving power and runt ime efficiency for several parallel genet ic algorithms under uniform conditions. The proposed method makes it possible to ide...
متن کاملSymbiotic Programming: Crossbreeding Cellular Automaton Rules on the CAM-6
One way to evolve new artificial lifeforms is to fuse existing forms in var ious ways . If one wishes for a new lifeform 's program to be the same size as each of it s parent pr ogram s, then one might take half of each parent program and pat ch the two halves together . T his method is typical of sexual repr oduction, and of the genet ic programming approach . A different meth od of crossbreed...
متن کاملGlobal Optimization of Functions with the Interval Genetic Algorithm
A new evolut ionary method for the global optimizat ion of fun ctions wit h cont inuous vari ab les is proposed . This algorit hm can be viewed as an efficient par allelization of the simula ted annealing technique , although a suitable interval coding shows a close ana logy between real-coded genet ic algorit hms and the pr oposed meth od , called int erval genetic algorithm . Some well-define...
متن کاملReal-coded Genetic Algorithms, Virtual Alphabets, and Blocking
This pap er present s a theory of convergence for realcoded genet ic algorit hmsGAs that use float ing-point or oth er highcardinality codings in their chromosomes . The theory is consistent with th e theory of schemata and postulates tha t select ion domin ates early GA perform ance and restri cts subsequent search to int ervals with above-average fun ction values, dimension-by-dimension. Thes...
متن کاملA Distributed Genetic Algorithm for Neural Network Design and Training
A bstract. A new approach for designing and training neural networks is developed using a distr ibuted genet ic algorithm. A search for the optimal architecture and weights of a neural network comprising binary, linear threshold units is performed. For each individual unit , we look for th e opt imal set of connections and associated weights under the restriction of a feedforward network str uc...
متن کامل